Modified least loaded routing in virtual path based ATM networks

We consider a Virtual Path (VP) based ATM network supporting multiple traffic classes with heterogeneous traffic characteristics. Using simple FIFO scheduling policy at the ATM multiplexer, we assume that all traffic require identical end-to-end quality of service (QoS) requirement. The concept of effective bandwidth is used to determine the required bandwidth to guarantee the specified QoS requirement. We study the problem of using dynamic routing to VP-based ATM networks by transforming it into an equivalent multi-rate circuit-switched network problem. To further simplify the analysis, we restrict the choice of path to single-link and two-link routes. We propose a dynamic routing algorithm based on the Least Loaded Routing (LLR) with packing. Simulation results are used to compare the performance of this algorithm with other dynamic routing schemes.